例文The same lower bound was later proved for the randomized algebraic decision tree model.When modified for the algebraic decision tree model, insertions and deletions would require O ( log 2 " n " ) expected time.